Computing the Hermite form of a matrix of Ore polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Hermite Form of a Matrix of Ore Polynomials

Let F[∂;σ, δ] be the ring of Ore polynomials over a field (or skew field) F, where σ is a automorphism of F and δ is a σ-derivation. Given a matrix A ∈ F[∂;σ, δ], we show how to compute the Hermite form H of A and a unimodular matrix U such that UA = H. The algorithm requires a polynomial number of operations in F in terms of n and the degrees (in ∂) of the entries in A. When F = k(z) for some ...

متن کامل

On Computing the Hermite Form of a Matrix of Differential Polynomials

Given a matrix A ∈ F(t)[D; δ] over the ring of differential polynomials, we show how to compute the Hermite form H of A and a unimodular matrix U such that UA = H . The algorithm requires a polynomial number of operations in F in terms of n, deg D A, deg t A. When F = Q it require time polynomial in the bit-length of the rational coefficients as well.

متن کامل

On Hermite-hermite Matrix Polynomials

In this paper the definition of Hermite-Hermite matrix polynomials is introduced starting from the Hermite matrix polynomials. An explicit representation, a matrix recurrence relation for the Hermite-Hermite matrix polynomials are given and differential equations satisfied by them is presented. A new expansion of the matrix exponential for a wide class of matrices in terms of Hermite-Hermite ma...

متن کامل

Computing Popov Form of Ore Polynomial Matrices

We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended...

متن کامل

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2013

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2012.11.033